POLYNOMIAL-FITTING INTERPOLATION RULES GENERATED BY A LINEAR FUNCTIONAL

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial fitting and interpolation on circular sections

We construct Weakly Admissible polynomial Meshes (WAMs) on circular sections, such as symmetric and asymmetric circular sectors, circular segments, zones, lenses and lunes. The construction resorts to recent results on subperiodic trigonometric interpolation. The paper is accompanied by a software package to perform polynomial fitting and interpolation at discrete extremal sets on such regions....

متن کامل

Curve Fitting by Fractal Interpolation

Fractal interpolation provides an efficient way to describe data that have an irregular or self-similar structure. Fractal interpolation literature focuses mainly on functions, i.e. on data points linearly ordered with respect to their abscissa. In practice, however, it is often useful to model curves as well as functions using fractal intepolation techniques. After reviewing existing methods f...

متن کامل

Polynomial Rewritings for Linear Existential Rules

We consider the scenario of ontology-based query answering. It is generally accepted that true scalability in this setting can only be achieved via query rewriting, which in turn allows for the exploitation of standard RDBMSs. In this work, we close two open fundamental questions related to query rewriting. We establish that linear existential rules are polynomially combined rewritable, while f...

متن کامل

A Monte Carlo Simulation of Photon Beam Generated by a Linear Accelerator

ntroduction:  Monte  Carlo  simulation  is  the  most  accurate  method  of  simulating  radiation  transport  and  predicting doses at different points of interest in radiotherapy. A great advantage of the Monte Carlo method  compared  to  the  deterministic  methods  is  the  ability  to  deal  accurately  with  any  complex  geometry.  Its  disadvantage is the extremely long computing time r...

متن کامل

Interpolation by Linear Programming

Given m,n ≥ 2 and > 0, we compute a function taking prescribed values at N given points of R, and having C norm as small as possible up to a factor 1 + . Our computation reduces matters to a linear programming problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications of the Korean Mathematical Society

سال: 2006

ISSN: 1225-1763

DOI: 10.4134/ckms.2006.21.2.397